Independence entropy of Z-shift spaces

نویسندگان

  • Erez Louidor
  • Brian Marcus
  • Ronnie Pavlov
چکیده

Topological entropy is the most fundamental numerical invariant associated to a d-dimensional shift space. When d = 1 and the shift space is a shift of finite type (SFT) or sofic shift, the topological entropy is easy to compute as the log of the largest eigenvalue of a nonnegative integer matrix. However, when d = 2 there is no known explicit expression for the topological entropy of SFTs, even for the simplest nontrivial examples. For instance, the one-dimensional golden mean shift is the set of all bi-infinite sequences of ‘0’s and ‘1’s such that 11 never appears. The topological entropy of this shift is well known to be the log of the golden mean, which is approximately ln(1.618). For the two-dimensional golden mean shift, defined to be the set of all configurations of ‘0’s and ‘1’s on Z such that 11 and 1 never appear, there is no known expression for the topological entropy. One analogously defines the d-dimensional golden mean shift for any d ≥ 1. It is well known that the topological entropy is a non-increasing function in d and thus has a limit. It is not so well known that the value of this limit is known in this case; namely it is ln(2) 2 ≈ ln(1.414) (see [11, 17]). One way of interpreting this result is as follows. For any d, call a site in Z even (resp., odd) if the sum of its coordinates is even (resp., odd). Now, if we assign value 0 to each even site, then we are free to assign arbitrary binary values to each of the odd sites; the ‘0’s in the even sites prevent two adjacent sites from both taking value 1. Equivalently, for any configuration of ‘0’s and ‘1’s on all of Z such that all even sites have value 0, then if we freely change the values at all odd sites in any way, the resulting configuration belongs to the golden mean shift. The number of possible restrictions of configurations of this form to a d-dimensional rectangular cube of even side length L is 2 d/2. The asymptotic growth rate of the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Independence entropy of Zd-shift spaces

We introduce a concept of independence entropy for symbolic dynamical systems. This notion of entropy measures the extent to which one can freely insert symbols in positions without violating the constraint defined by the shift space. We show that for a certain class of one-dimensional shift spaces X, the independence entropy coincides with the limiting, as d tends to infinity, topological entr...

متن کامل

Shift-invariant Spaces on the Real Line

We investigate the structure of shift-invariant spaces generated by a finite number of compactly supported functions in Lp(R) (1 ≤ p ≤ ∞). Based on a study of linear independence of the shifts of the generators, we characterize such shift-invariant spaces in terms of the semi-convolutions of the generators with sequences on Z. Moreover, we show that such a shiftinvariant space provides Lp-appro...

متن کامل

Notes on Free Probability Theory

Lecture 1. Free Independence and Free Harmonic Analysis. 2 1.1. Probability spaces. 2 1.2. Non-commutative probability spaces. 3 1.3. Classical independence. 4 1.4. Free products of non-commutative probability spaces. 5 1.5. Free Fock space. 6 1.6. Free Central Limit Theorem. 8 1.7. Free Harmonic Analysis. 10 1.8. Further topics. 16 Lecture 2. Random Matrices and Free Probability. 17 2.1. Rando...

متن کامل

Almost Block Independence for the Three Dot Z Dynamical System

We show that the measure preserving action of Z2 dual to the action defined by the commuting automorphisms ×x and ×y on the discrete group Z[x±1, y±1]/〈1 +x+ y〉Z[x±1, y±1] is measurably isomorphic to a Z2 Bernoulli shift. This was conjectured in recent work by Lind, Schmidt and the author, where it was shown that this action has completely positive entropy. An example is given of Z2 actions whi...

متن کامل

Entropy for Symbolic Dynamics with Overlapping Alphabets

We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of entropies of (standard) full shifts. When a shift space with overlaps arises as a model for a discrete dynamical system with a finite set of overlapping neighborho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010